Ferenc Hunyadi, an almost completely forgotten Transylvanian humanist

نویسندگان

چکیده

Abstract Although the name of Ferenc Hunyadi is known in Hungarian literary history mainly for his Hungarian-language historical song about peril Troy, there also exist more than five thousand lines Latin poetry by him which have not been collected or published since 16 th century. Another eleven poems are from a manuscript written Unitarian pastor early 17 A further, one-distich poem was recorded István Szamosközy. The date composition can be placed roughly between end 1586 and 1599. In addition to these, kept Oxford gives prescriptions febrile diseases. As starting point further research, this paper summarises what currently works.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aluminosis – Detection of an almost forgotten disease with HRCT

The aim of this study was to investigate whether it is possible to detect high-resolution computed tomography (HRCT) findings in aluminium powder workers, which are consistent with early stages of aluminosis.62 male workers from 8 departments of two plants producing aluminium (Al) powder were investigated using a standardized questionnaire, physical examination, lung function analysis, biologic...

متن کامل

Almost forgotten or latest practice? AFLP applications, analyses and advances.

Amplified fragment length polymorphism (AFLP) DNA fingerprinting is a firmly established molecular marker technique, with broad applications in population genetics, shallow phylogenetics, linkage mapping, parentage analyses, and single-locus PCR marker development. Technical advances have presented new opportunities for data analysis, and recent studies have addressed specific areas of the AFLP...

متن کامل

Settling the Complexity of Local Max-Cut (Almost) Completely

We consider the problem of finding a local optimum for Max-Cut with FLIP-neighborhood, in which exactly one node changes the partition. Schäffer and Yannakakis (SICOMP, 1991) showed PLScompleteness of this problem on graphs with unbounded degree. On the other side, Poljak (SICOMP, 1995) showed that in cubic graphs every FLIP local search takes O(n) steps, where n is the number of nodes. Due to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hungarian Studies

سال: 2022

ISSN: ['1588-2772', '0236-6568']

DOI: https://doi.org/10.1556/044.2022.00199